Integer rounding and modified integer rounding for the skiving stock problem
نویسندگان
چکیده
منابع مشابه
Integer rounding and modified integer rounding for the skiving stock problem
We consider the one-dimensional skiving stock problem which is also known as the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply of m ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we investigate the quality of the continuous relaxation by considering...
متن کاملInteger linear programming models for the skiving stock problem
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply ofm ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we present three new models (the arcflowmodel, the onestick model...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملOptimal rounding under integer constraints
Given N real numbers whose sum is an integer, we study the problem of finding N integers which match these real numbers as closely as possible, in the sense of Lp norm, while preserving the sum. We describe the structure of solutions for this integer optimization problem and propose an algorithm with complexity O(N logN) for solving it. In contrast to fractional rounding and randomized rounding...
متن کامل9839 AGGREGATION and MIXED INTEGER ROUNDING toSOLVE
A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of \strong" valid inequalities for speciic models and computationally gives results as good as or better than those obtained from several existing separation routines including ow cover and integer cover inequalities. The heuristic is based on aggregation of constraints of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.06.004